Higher-order Processes with Parameterization over Names and Processes
نویسندگان
چکیده
منابع مشابه
Higher-order Processes with Parameterization over Names and Processes
Parameterization extends higher-order processes with the capability of abstraction and application (like those in lambda-calculus). This extension is strict, i.e., higher-order processes equipped with parameterization is computationally more powerful. This paper studies higher-order processes with two kinds of parameterization: one on names and the other on processes themselves. We present two ...
متن کاملClassical Higher-Order Processes
Classical Processes (CP) is a calculus where the proof theory of classical linear logic types communicating processes with mobile channels, à la π -calculus. Its construction builds on a recent propositions as types correspondence between session types and propositions in linear logic. Desirable properties such as type preservation under reductions and progress come for free from the metatheory...
متن کاملSOS for Higher Order Processes
We lay the foundations for a Structural Operational Semantics (SOS) framework for higher order processes. Then, we propose a number of extensions to Bernstein’s promoted tyft/tyxt format which aims at proving congruence of strong bisimilarity for higher order processes. The extended format is called promoted PANTH. This format is easier to apply and strictly more expressive than the promoted ty...
متن کاملReasoning about Higher-Order Processes
We address the speci cation and veri cation problem for process calculi such as Chocs, CML and Facile where processes or functions are transmissible values. Our work takes place in the context of a static treatment of restriction and of a bisimulation-based semantics. As a paradigmatic and simple case we concentrate on (Plain) Chocs. We show that Chocs bisimulation can be characterized by an ex...
متن کاملHigher Order Pde’s and Iterated Processes
We introduce a class of stochastic processes based on symmetric α-stable processes, for α ∈ (0, 2]. These are obtained by taking Markov processes and replacing the time parameter with the modulus of a symmetric α-stable process. We call them α-time processes. They generalize Brownian time processes studied in Allouba and Zheng (2001), Allouba (2002), (2003), and they introduce new interesting e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2016
ISSN: 2075-2180
DOI: 10.4204/eptcs.222.2